A parallel primal–dual interior-point method for semidefinite programs using positive definite matrix completion
نویسندگان
چکیده
منابع مشابه
A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion
A parallel computational method SDPARA-C is presented for SDPs (semidefinite programs). It combines two methods SDPARA and SDPA-C proposed by the authors who developed a software package SDPA. SDPARA is a parallel implementation of SDPA and it features parallel computation of the elements of the Schur complement equation system and a parallel Cholesky factorization of its coefficient matrix. SD...
متن کاملParallel Primal-dual Interior-point Methods for Semidefinite Programs B-415 Parallel Primal-dual Interior-point Methods for Semidefinite Programs
The Semidefinite Program (SDP) is a fundamental problem in mathematical programming. It covers a wide range of applications, such as combinatorial optimization, control theory, polynomial optimization, and quantum chemistry. Solving extremely large-scale SDPs which could not be solved before is a significant work to open up a new vista of future applications of SDPs. Our two software packages S...
متن کاملFast implementation for semidefinite programs with positive matrix completion
Solving semidefinite programs (SDP) in a short time is the key to managing various mathematical optimization problems in practical time. The matrix-completion primal-dual interior-point method (MC-PDIPM) extracts a structural sparsity of input SDP by factorizing the variable matrices, and it shrinks the computation time. In this paper, we propose a new factorization based on the inverse of the ...
متن کاملAn Interior-Point Method for Approximate Positive Semidefinite Completions
Given a nonnegative, symmetric matrix of weights, H , we study the problem of finding an Hermitian, positive semidefinite matrix which is closest to a given Hermitian matrix, A, with respect to the weighting H . This extends the notion of exact matrix completion problems in that, Hi j = 0 corresponds to the element Ai j being unspecified (free), while Hi j large in absolute value corresponds to...
متن کاملActive Positive-Definite Matrix Completion
In the FindCandidates function (line 4), Select finds all the single edges that can be added to the current mask graph GΩ while maintaining its chordal structure. To do that, we make use of the clique tree data structure as introduced by Ibarra [1]. Given a graph G = (V,E), the clique tree is a tree C = (VC , EC), in which each node is a maximal clique of G, i.e., VC ⊂ 2 . In our case the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2006
ISSN: 0167-8191
DOI: 10.1016/j.parco.2005.07.002